home *** CD-ROM | disk | FTP | other *** search
- Path: mayne.ugrad.cs.ubc.ca!not-for-mail
- From: c2a192@ugrad.cs.ubc.ca (Kazimir Kylheku)
- Newsgroups: comp.lang.c
- Subject: Re: Regular Expression Parser
- Date: 1 Apr 1996 19:14:46 -0800
- Organization: Computer Science, University of B.C., Vancouver, B.C., Canada
- Message-ID: <4jq636INN8hm@mayne.ugrad.cs.ubc.ca>
- References: <4jplp2$9io@srvr1.engin.umich.edu>
- NNTP-Posting-Host: mayne.ugrad.cs.ubc.ca
-
- In article <4jplp2$9io@srvr1.engin.umich.edu>,
- Tom Kludy <tkludy@rep00687.reshall.umich.edu> wrote:
- >I am a reasonably proficient C programmer. Recently, I learned Perl for
- >my job. I am very disappointed with Perl's speed (due to it's being an
- >interpreted language) and therefore have returned to C.
- >
- >However, Perl has many functions that greatly simplify programming, and I
- >have decided to rewrite most of these functions in C. There is one very
- >important thing that I need, though - a regular expression parser.
- >Is there one already written (with source available)? If not, I'll start
-
- No, never! The Linux and FreeBSD operating systems have regex code in their
- libraries which has been obtained from Microsoft under a strict non-disclosure
- agreement. The source code is, needless to say, unavailable.
-
- >on the task of writing one myself, or trying to hack it directly from the
- >perl source (ugh).
-
- Good luck! The established practice is to construct the DFA directly from the
- regular expression, followed by a subset deconstruction to yield the NFA.
- --
-
-